Investigating the benefits of virtual reality on student acquisition of 3D anatomical information

Virtual reality (VR) technology is becoming more accessible within educational settings due to price decreases and greater software availability. VR is particularly useful for teaching anatomy, as students often struggle to learn the three-dimensional relationships between body structures from two-dimensional images in textbooks. Using funds from Augustana’s Pedagogy and Technology Grant, we purchased and assembled a VR workstation and began researching the effectiveness of VR in anatomy education. The early results of this research show that students exhibited substantial increases in their knowledge anatomical structures and their ability to reconstruct the three-dimensional relationships between anatomical structures after 30 minutes using the 3D Organon VR Anatomy© program. This increase, however, was similar to the knowledge increase shown by students using an anatomy visualization program made for desktop computers from the same company. When asked to compare the two, students indicated a preference for the VR program because of the ability to interact with structures in three-dimensions. Furthermore, participants reported that the VR program was easy to use, even though very few of them had previously used VR. These results, while preliminary, indicate that VR has the potential to greatly enhance the student experience of learning anatomy when used in conjunction with traditional anatomical education methods

Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality

We consider the all pairs all shortest paths (APASP) problem, which maintains the shortest path dag rooted at every vertex in a directed graph G=(V,E) with positive edge weights. For this problem we present a decremental algorithm (that supports the deletion of a vertex, or weight increases on edges incident to a vertex). Our algorithm runs in amortized O(\vstar^2 \cdot \log n) time per update, where n=|V|, and \vstar bounds the number of edges that lie on shortest paths through any given vertex. Our APASP algorithm can be used for the decremental computation of betweenness centrality (BC), a graph parameter that is widely used in the analysis of large complex networks. No nontrivial decremental algorithm for either problem was known prior to our work. Our method is a generalization of the decremental algorithm of Demetrescu and Italiano [DI04] for unique shortest paths, and for graphs with \vstar =O(n), we match the bound in [DI04]. Thus for graphs with a constant number of shortest paths between any pair of vertices, our algorithm maintains APASP and BC scores in amortized time O(n^2 \log n) under decremental updates, regardless of the number of edges in the graph.Comment: An extended abstract of this paper will appear in Proc. ISAAC 201

A 2k2k-Vertex Kernel for Maximum Internal Spanning Tree

We consider the parameterized version of the maximum internal spanning tree problem, which, given an $n$-vertex graph and a parameter $k$, asks for a spanning tree with at least $k$ internal vertices. Fomin et al. [J. Comput. System Sci., 79:1-6] crafted a very ingenious reduction rule, and showed that a simple application of this rule is sufficient to yield a $3k$-vertex kernel. Here we propose a novel way to use the same reduction rule, resulting in an improved $2k$-vertex kernel. Our algorithm applies first a greedy procedure consisting of a sequence of local exchange operations, which ends with a local-optimal spanning tree, and then uses this special tree to find a reducible structure. As a corollary of our kernel, we obtain a deterministic algorithm for the problem running in time $4^k \cdot n^{O(1)}$

Isolated Meningeal Recurrence of Transitional Cell Carcinoma of the Bladder

Meningeal carcinomatosis occurs in 1–18% of patients with solid tumours, most commonly carcinomas of the breast and lung or melanomas. There are relatively few reports of meningeal carcinomatosis in transitional cell carcinoma of the bladder. Isolated meningeal recurrence is particularly uncommon, and we present an unusual case of this in a 58-year-old man. The case was further complicated by the somewhat atypical presentation with a confirmed ischaemic stroke. The patient died one month after presentation

Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane

We study the following separation problem: Given a collection of pairwise disjoint coloured objects in the plane with k different colours, compute a shortest “fence” F, i.e., a union of curves of minimum total length, that separates every pair of objects of different colours. Two objects are separated if F contains a simple closed curve that has one object in the interior and the other in the exterior. We refer to the problem as GEOMETRIC k-CUT, as it is a geometric analog to the well-studied multicut problem on graphs. We first give an O(n4log3n)-time algorithm that computes an optimal fence for the case where the input consists of polygons of two colours with n corners in total. We then show that the problem is NP-hard for the case of three colours. Finally, we give a randomised 4/3⋅1.2965-approximation algorithm for polygons and any number of colours

Station Assignment with Applications to Sensing

Abstract. We study an allocation problem that arises in various scenarios. For instance, a health monitoring system where ambulatory patients carry sensors that must periodically upload physiological data. Another example is participatory sensing, where communities of mobile device users upload periodically information about their environment. We assume that devices or sensors (generically called clients) join and leave the system continuously, and they must upload/download data to static devices (or base stations), via radio transmissions. The mobility of clients, the limited range of transmission, and the possibly ephemeral nature of the clients are modeled by characterizing each client with a life interval and a stations group, so that different clients may or may not coincide in time and/or stations to connect. The intrinsically shared nature of the access to base stations is modeled by introducing a maximum station bandwidth that is shared among its connected clients, a client laxity, which bounds the maximum time that an active client is not transmitting to some base station, and a client bandwidth, which bounds the minimum bandwidth that a client requires in each transmission. Under the model described, we study the problem of assigning clients to base stations so that every client transmits to some station in its group, limited by laxities and bandwidths. We call this problem the Station Assignment problem. We study the impact of the rate and burstiness of the arrival of clients on the solvability of Station Assignment. To carry out a worst-case analysis we use a typical adversarial methodology: we assume the presence of an adversary that controls the arrival and departure of clients. The adversar

Confluence and Convergence in Probabilistically Terminating Reduction Systems

Convergence of an abstract reduction system (ARS) is the property that any derivation from an initial state will end in the same final state, a.k.a. normal form. We generalize this for probabilistic ARS as almost-sure convergence, meaning that the normal form is reached with probability one, even if diverging derivations may exist. We show and exemplify properties that can be used for proving almost-sure convergence of probabilistic ARS, generalizing known results from ARS.Comment: Pre-proceedings paper presented at the 27th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2017), Namur, Belgium, 10-12 October 2017 (arXiv:1708.07854

Investigation on the competing effects of clay dispersion and matrix plasticisation for polypropylene/clay nanocomposites. Part II: Crystalline structure and thermo-mechanical behaviour

In view of the structure–property relationship, the mechanical property enhancement of polypropylene (PP)/clay nanocomposites can also be associated with the alterations of their crystalline structures and behaviour in addition to the general interpretation of intercalation/exfoliation level and uniform dispersion of more rigid clay platelets with higher aspect ratios in the PP matrix. Wide-angle X-ray diffraction (WAXD) was utilised to evaluate the effects of clay content, maleated PP (MAPP) content (MAPP as the compatibiliser) on PP crystalline structures of nanocomposites. Furthermore, the melting and crystallisation behaviour of PP/clay nanocomposites was also investigated by conducting differential scanning calorimetry (DSC). The thermo-mechanical properties were characterised via dynamic mechanical thermal analysis (DMTA). It is observed that enhancement of mechanical properties are mainly affected by the preferred orientation of PP crystals, the growth of α-PP phase and effective nucleating agent role of additional clay while the excessive amount of MAPP becomes detrimental to these crucial aspects, which is also evidently revealed in DMTA measurements

Recombinant Expression, Purification, and Functional Characterisation of Connective Tissue Growth Factor and Nephroblastoma-Overexpressed Protein

The CCN family of proteins, especially its prominent member, the Connective tissue growth factor (CTGF/CCN2) has been identified as a possible biomarker for the diagnosis of fibrotic diseases. As a downstream mediator of TGF-β1 signalling, it is involved in tissue scarring, stimulates interstitial deposition of extracellular matrix proteins, and promotes proliferation of several cell types. Another member of this family, the Nephroblastoma-Overexpressed protein (NOV/CCN3), has growth-inhibiting properties. First reports further suggest that these two CCN family members act opposite to each other in regulating extracellular matrix protein expression and reciprocally influence their own expression when over-expressed. We have established stable HEK and Flp-In-293 clones as productive sources for recombinant human CCN2/CTGF. In addition, we generated an adenoviral vector for recombinant expression of rat NOV and established protocols to purify large quantities of these CCN proteins. The identity of purified human CCN2/CTGF and rat CCN3/NOV was proven by In-gel digest followed by ESI-TOF/MS mass spectrometry. The biological activity of purified proteins was demonstrated using a Smad3-sensitive reporter gene and BrdU proliferation assay in permanent cell line EA•hy 926 cells. We further demonstrate for the first time that both recombinant CCN proteins are N-glycosylated

Contributions to the phylogeny of Ixodes (Pholeoixodes) canisuga, I. (Ph.) kaiseri, I. (Ph.) hexagonus and a simple pictorial key for the identification of their females

Background: In Europe, hard ticks of the subgenus Pholeoixodes (Ixodidae: Ixodes) are usually associated with burrow-dwelling mammals and terrestrial birds. Reports of Pholeoixodes spp. from carnivores are frequently contradictory, and their identification is not based on key diagnostic characters. Therefore, the aims of the present study were to identify ticks collected from dogs, foxes and badgers in several European countries, and to reassess their systematic status with molecular analyses using two mitochondrial markers. Results: Between 2003 and 2017, 144 Pholeoixodes spp. ticks were collected in nine European countries. From accurate descriptions and comparison with type-materials, a simple illustrated identification key was compiled for adult females, by focusing on the shape of the anterior surface of basis capituli. Based on this key, 71 female ticks were identified as I. canisuga, 21 as I. kaiseri and 21 as I. hexagonus. DNA was extracted from these 113 female ticks, and from further 31 specimens. Fragments of two mitochondrial genes, cox1 (cytochrome c oxidase subunit 1) and 16S rRNA, were amplified and sequenced. Ixodes kaiseri had nine unique cox1 haplotypes, which showed 99.2-100% sequence identity, whereas I. canisuga and I. hexagonus had eleven and five cox1 haplotypes, respectively, with 99.5-100% sequence identity. The distribution of cox1 haplotypes reflected a geographical pattern. Pholeoixodes spp. ticks had fewer 16S rRNA haplotypes, with a lower degree of intraspecific divergence (99.5-100% sequence identity) and no geographical clustering. Phylogenetic analyses were in agreement with morphology: I. kaiseri and I. hexagonus (with the similar shape of the anterior surface of basis capituli) were genetically more closely related to each other than to I. canisuga. Phylogenetic analyses also showed that the subgenus Eschatocephalus (bat ticks) clustered within the subgenus Pholeoixodes. Conclusions: A simple, illustrated identification key is provided for female Pholeoixodes ticks of carnivores (including I. hexagonus and I. rugicollis) to prevent future misidentification of these species. It is also shown that I. kaiseri is more widespread in Europe than previously thought. Phylogenetic analyses suggest that the subgenus Pholeoixodes is not monophyletic: either the subgenus Eschatocephalus should be included in Pholeoixodes, or the latter subgenus should be divided, which is a task for future studies